Type Theory in Ludics
نویسنده
چکیده
We present some first steps in the more general setting of the interpretation of dependent type theory in Ludics. The framework is the following: a (Martin-Löf) type A is represented by a behaviour (which corresponds to a formula) in such a way that canonical elements of A are interpreted in a set that is principal for the behaviour, where principal means in some way a minimal generator. We introduce some notions on Ludics and the interpretation of Martin-Löf rules. Then we propose a representation for simple types in Ludics, i.e., natural numbers, lists, the arrow construction and the usual constructors.
منابع مشابه
Inductive and Functional Types in Ludics
Ludics is a logical framework in which types/formulas are modelled by sets of terms with the same computational behaviour. This paper investigates the representation of inductive data types and functional types in ludics. We study their structure following a game semantics approach. Inductive types are interpreted as least fixed points, and we prove an internal completeness result giving an exp...
متن کاملArgumentation and Inference: A Unified Approach
We propose in this paper to use Ludics as a unified framework for the analysis of dialogue and the reasoning system. Not only is Ludics a logical theory, but it may also be built by means of concepts of game theory. We first present the main concepts of Ludics. A design is an abstraction and a generalization of the concept of proof. Interaction between designs is equivalent to cut elimination o...
متن کاملIntroduction to linear logic and ludics, part II
This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic (section 1) and to ludics, which has been recently developped in an aim of further unveiling the fundamental interactive nature of computation and logic (sections 2, 3, 4, and 5). We hope to offer a fe...
متن کاملTowards Ludics Programming: Interactive Proof Search
Girard [10] introduced Ludics as an interactive theory aiming at overcoming the distinction between syntax and semantics in logic. In this paper, we investigate how ludics could serve as a foundation for logic programming, providing a mechanism for interactive proof search, that is proof search by interaction (or proof search by cut-elimination).
متن کاملLudics without Designs I: Triads
An orthodox introduction of a paper on ludics should begin as follows. First, the authors say what ludics is commonly intended to be: typically, they would say that it is a kind of game semantics which is close to the more popular categorical game models for linear logic and PCF introduced in the last twenty years. Having set up the context, then they could informally describe ludics as an unty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1402.2511 شماره
صفحات -
تاریخ انتشار 2013